Computational Abstraction

نویسندگان

چکیده

Representation and abstraction are two of the fundamental concepts computer science. Together they enable “high-level” programming: without programming would be tied to machine code; a representation, it pure mathematical exercise. begins with an abstract structure seeks find more concrete one. Abstraction does reverse: starts structures abstracts away. While formal accounts representation easy find, is different matter. In this paper, we provide analysis data based upon some contemporary work in philosophy mathematics. The paper contains account how Frege’s approach may interpreted, modified, extended imported into type theory. We argue that abstraction, while siblings, philosophically quite different. A case special interest concerns abstract/physical interface which houses both physical systems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Abstraction Steps

In this paper we discuss computational abstraction steps as a way to create class abstractions from concrete objects, and from examples. Computational abstraction steps are regarded as symmetric counterparts to computational concretisation steps, which are well-known in terms of function calls and class instantiations. Our teaching experience shows that many novice programmers find it difficult...

متن کامل

Computational visualization - graphics, abstraction, and interactivity

If you get the printed book in on-line book store, you may also find the same problem. So, you must move store to store and search for the available there. But, it will not happen here. The book that we will offer right here is the soft file concept. This is what make you can easily find and get this computational visualization graphics abstraction and interactivity by reading this site. We off...

متن کامل

Calibrating Computational Feasibility by Abstraction Rank

We characterize computationally the functions provable in second order logic with set existence restricted to natural classes of rst order formulas. A classi cation of rst-order set-existence by implicational rank yields a natural hierarchy of complexity classes within the class of Kalmar-elementary functions: The functions over f0; 1g constructively provable using set existence for formulas of...

متن کامل

Abstraction Levels for Robotic Imitation: Overview and Computational Approaches

ion Levels for Robotic Imitation: Overview and Computational Approaches Manuel Lopes, Francisco Melo, Luis Montesano and José Santos-Victor Abstract This chapter reviews several approaches to the problem of learning by imitation in robotics. We start by describing several cognitive processes identified in the literature as necessary for imitation. We then proceed by surveying different approach...

متن کامل

An Intermediate Level of Abstraction for Computational Systems Chemistry

Computational techniques are required for narrowing down the vast space of possibilities to plausible prebiotic scenarios, because precise information on the molecular composition, the dominant reaction chemistry and the conditions for that era are scarce. The exploration of large chemical reaction networks is a central aspect in this endeavour. While quantum chemical methods can accurately pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Entropy

سال: 2021

ISSN: ['1099-4300']

DOI: https://doi.org/10.3390/e23020213